Searching Informed Game Trees
نویسندگان
چکیده
Well-known algorithms for the evaluation of the minimax function in game trees are alpha-beta Knuth] and SSS* Stockman]. An improved version of SSS* is SSS-2 Pijls-1]. All these algorithms don't use any heuristic information on the game tree. In this paper the use of heuristic information is introduced into the alpha-beta and the SSS-2 algorithm. Extended versions of these algorithms are presented. The subset of nodes which is visited during execution of each algorithm is characterised completely.
منابع مشابه
Pathology on Game Trees: A Summary of Results
Game trees are widely used as models of various decision-making situations. Empirical results with game-playing computer programs have led to the general belief that searching deeper on a game tree improves the quality of a decision. The surprising result of the research summarized in this paper is that there is an infinite class of game trees for which increasing the search depth does not impr...
متن کاملA Theory of Game Trees, Based on Solution Trees
In this paper, a theory of game tree algorithms is presented, entirely based upon the concept of solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that a game tree algorithm actually constructs a superposition of a max and a min solution tree. For algorithms searching a game tree, a cutoo criterion is suitable. A cut-oo criterion in t...
متن کاملProblems in Sequential and Parallel Game Tree Search
The |{ algorithm is an eecient technique for searching game trees. As parallel computers become more available, it is important to have good parallel game tree search algorithms. Until now it is an open problem whether a linear speedup can be achieved with respect to sequential alpha{ beta. This note presents a sample of game trees with distinct leaf values, which are easy for sequential alpha{...
متن کاملOn Minimax Game Tree Search Pathology and Node-Value Dependence
Here we are concerned with the mysterious phenomenon of minimax game-tree search pathology, where it appears and how it happens. It is commonly believed that the strategy of searchingdeeper for computer game-playing programs can enhance the accuracy of position evaluation and increase the possibility of detecting the correct move. The strategy has been successfully implemented in practice; but ...
متن کاملSearching Game Trees in Parallel
We present a new parallel game-tree search algorithm. Our approach classifies a processor’s available work as either mandatory (necessary for the solution) or speculative (may be necessary for the solution). Due to the nature of parallel game tree search, it is not possible to keep all processors busy with mandatory work. Our algorithm ER allows potential speculative work to be dynamically orde...
متن کامل